MOHEX Wins Hex Tournament
نویسندگان
چکیده
منابع مشابه
MOHEX Wins Hex Tournament
The 2011 Hex competition started on Sunday November 20 and finished on Monday November 21. Three programs competed: PANORAMEX by Fabien Teytaud, Tristan Cazenave, and Nicolas Jouandeau from France; WOLVE by Broderick Arneson, Ryan Hayward, and Philip Henderson from Canada; and MOHEX by Philip Henderson, Broderick Arneson, and Ryan Hayward. This year Aja Huang from Taiwan and Jakub Pawlewicz fro...
متن کاملHex 2017: MoHex wins the 11x11 and 13x13 tournaments
The 2017 Olympiad in Leiden hosted two Hex tournaments, board sizes 11×11 and 13×13. Three programs competed in each tournament. These are at present the only annual computer Hex tournaments. 11×11 is the original board size introduced by Piet Hein in 1942. Recently, all 1-move openings on 9×9Hex have been solved by computers, as have two 10×10 openings [9]. So, in recent years the 13×13 compet...
متن کاملMohex Wins 2015 Hex 11×11 and Hex 13×13 Tournaments
DeepHex is a new program based on Sibling Conspiracy Number Search (Pawlewicz and Hayward, 2015a,b). DeepHex, like MoHex, is based on the Benzene framework, developed by Broderick Arneson, Philip Henderson, Ryan Hayward, Aja Huang, and Jakub Pawlewicz. DeepHex ran on a 16 core shared-memory machine. As an opening book, DeepHex cached its evaluation scores in a database, running for 24 hours on ...
متن کاملGOLOIS Wins Phantom Go Tournament
Phantom Go is a two-player game often played as an entertaining variation by regular Go players. It is the equivalent of Kriegspiel for Chess. Phantom Go is a variant of classic Go in which the players do not see the opponent’s moves. Two players each have their own board, on which only their own stones are visible. A referee is needed. He has a reference board on which the actual state of the ...
متن کاملMoHex 2.0: A Pattern-Based MCTS Hex Player
In recent years the Monte Carlo tree search revolution has spread from computer Go to many areas, including computer Hex. MCTS Hex players now outperform traditional knowledge-based alpha-beta search players, and the reigning Computer Olympiad Hex gold medallist is the MCTS player MoHex. In this paper we show how to strengthen MoHex, and observe that — as in computer Go — using learned patterns...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ICGA Journal
سال: 2013
ISSN: 1389-6911,2468-2438
DOI: 10.3233/icg-2013-36318